Computing with rewrite systems

On Computing Reachability Sets of Process Rewrite Systems

We consider the problem of symbolic reachability analysis of a class of term rewrite systems called Process Rewrite Systems (PRS). A PRS can be seen as the union of two mutually interdependent sets of term rewrite rules: a prefix rewrite system (or, equivalently, a pushdown system), and a multiset rewrite system (or, equivalently, a Petri net). These systems are natural models for multithreaded...

Rewrite Systems

Completion of Rewrite Systems with Membership Constraints

We consider a constraint system involving equations and membership constraints. Membership constraints are interpreted as the membership to some recognizable tree languages. The terms may contain a restricted kind of context variables. We give a set of constraint solving rules which is proved to be complete and terminating. This gives a uniication algorithm for an order-sorted logic (without an...

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

Various classes of infinite-state processes are often specified by rewrite systems. We extend Mayr’s Process Rewrite Systems (PRS) [13] by finite-state unit whose transition function satisfies some restrictions inspired by weak finite automata. We classify these models by their expressiveness and show how the hierarchy of new classes (w.r.t. bisimilarity) is related to both PRS hierarchy of May...

Process Rewrite Systems

Many formal models for in nite-state concurrent systems are equivalent to special classes of rewrite systems. We classify these models by their expressiveness and de ne a hierarchy of classes of rewrite systems. We show that this hierarchy is strict with respect to bisimulation equivalence. The most general and most expressive class of systems in this hierarchy is called Process Rewrite Systems...